Error Correction for Index Coding With Side Information
نویسندگان
چکیده
منابع مشابه
Index coding with side information
The Index Coding problem has attracted a considerable amount of attention in the recent years. The problem is motivated by several applications in wireless networking and distributed computing. An instance of the index coding problem includes a sender that holds an input x = (x1, x2, . . . , xn) ∈ {0, 1} and communicates with n receivers R1, . . . , Rn using wireless broadcast channel. Each rec...
متن کاملSecure Index Coding with Side Information
Security aspects of the Index Coding with Side Information (ICSI) problem are investigated. Building on the results of Bar-Yossef et al. (2006), the properties of linear coding schemes for the ICSI problem are further explored. The notion of weak security, considered by Bhattad and Narayanan (2005) in the context of network coding, is generalized to block security. It is shown that the coding s...
متن کاملOn zero-error source coding with decoder side information
Let ( ) be a pair of random variables distributed over a finite product set according to a probability distribution ( ). The following source coding problem is considered: the encoder knows , while the decoder knows and wants to learn without error. The minimum zero-error asymptotic rate of transmission is shown to be the complementary graph entropy of an associated graph. Thus, previous result...
متن کاملZero-Error Source-Channel Coding With Side Information
We consider coding for transmission of a source through a channel without error when the receiver has side information about the source. We show that separate source and channel coding is asymptotically suboptimal in general. By contrast, in the case of vanishingly small probability of error, separate source and channel coding is known to be asymptotically optimal. For the zero-error case, we s...
متن کاملEfficient Pattern Index Coding Using Syndrome Coding and Side Information
Pattern-based video coding focusing on moving regions has already established its superiority over the H.264 at very low bit rate. Up to a certain limit, the larger the number of pattern templates, the better the approximation to the moving regions. However, beyond that limit no coding gain is observed due to the need of an excessive number of pattern identification bits (PIC). Recently, distri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2012.2227674